نتایج جستجو برای: Parallel Simulated annealing algorithm
تعداد نتایج: 1054072 فیلتر نتایج به سال:
a facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. an efficient layout contributes to the overall efficiency of operations. it’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. consequently, the efficiency of the current layout decreases or is lost and it ...
this paper presents a new mathematical model for a redundancyallocation problem (rap) withcold-standby redundancy strategy and multiple component choices.the applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...
This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an eeective combination of simulated annealing and genetic algorithms, called parallel recombinative simulated annealing, is developed. This new algorithm strives to retain the desirable asymptotic convergence properties of simulated annealing, while adding the populations approach an...
This paper proposes a new algorithm of a simulated annealing (SA): Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). The proposed algorithm consists of several processes, and in each process SA is operated. The genetic crossover is used to exchange information between solutions at fixed intervals. While SA requires high computational costs, particularly in continuous problems, thi...
This paper deals with a new algorithm of a parallel simulated annealing HGSA which includes genetic crossover operations. The genetic crossover is used as an enhancement of the origin parallel simulated annealing PSA which allows to recombine solutions produced by individual simulate annealing processes at fixed time intervals. It is found that the proposed algorithm can speed—up the search the...
This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage o...
We present a parallel computational environment used to determine conductivity properties of human head tissues when the effects of skull inhomogeneities are modeled. The environment employs a parallel simulated annealing algorithm to overcome poor convergence rates of the simplex method for larger numbers of head tissues required for accurate modeling of electromagnetic dynamics of brain funct...
Genetic algorithm is widely used in optimization problems for its excellent global search capabilities and highly parallel processing capabilities; but, it converges prematurely and has a poor local optimization capability in actual operation. Simulated annealing algorithm can avoid the search process falling into local optimum. A hybrid genetic algorithm based on simulated annealing is designe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید